A Cooperative and Heuristic Community Detecting Algorithm

This paper introduces the concept of community seed, vector and relation matrix. In terms of the relation similarity between free vertices and the existing communities, we put vertices into different groups. A minimum similarity threshold is proposed to filter which gives a method to find the vertices located at the overlapped area between different communities. This paper analyzes a series of network dataset and proves that our algorithm is able to accurately find communities with high cohesion and weak coupling. We use a variety of test to demonstrate that our algorithm is highly effective at detecting community structures in both computer-generated and real-world networks.